Varshamov-Gilbert bound

См. также в других словарях:

• Gilbert-Varshamov bound — The Gilbert Varshamov bound is a bound on the parameters of a (not necessarily linear) code. It is occasionally known as the Gilbert Shannon Varshamov bound (or the GSV bound ), but the Gilbert Varshamov bound is by far the most popular… …   Wikipedia

• Singleton bound — In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude bound on the size of a block code C with block length n, size r and minimum distance d. Contents 1 Statement of the Bound 2 Proof …   Wikipedia

• Plotkin bound — In the mathematics of coding theory, the Plotkin bound is a bound on the size of binary codes of length n and minimum distance d. Statement of the Bound Let C be a binary code of length n, i.e. a subset of mathbb{F} 2^n. Let d be the minimum… …   Wikipedia

• Johnson bound — The Johnson bound is a bound on the size of error correcting codes.Let C be a q ary code of length n, i.e. a subset of mathbb{F} q^n. Let d be the minimum distance of C, i.e. :d = min {x,y in C, x eq y} d(x,y) where d(x,y) is the Hamming distance …   Wikipedia

• Hamming bound — In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere packing bound or the volume bound from an interpretation in terms of… …   Wikipedia

• List of algebraic coding theory topics — This is a list of algebraic coding theory topics. ARQ[disambiguation needed  ] Adler 32 BCH code BCJR algorithm Berger code Berlekamp Massey algo …   Wikipedia

• Concatenated error correction code — In coding theory, concatenated codes form a class of error correcting codes that are derived by combining an inner code and an outer code. They were conceived in 1966 by Dave Forney as a solution to the problem of finding a code that has both… …   Wikipedia

• List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

• Alternant code — In coding theory, alternant codes form a class of parameterised error correcting codes which generalise the BCH codes.DefinitionAn alternant code over GF( q ) of length n is defined by a parity check matrix H of alternant form H i , j = αji y i …   Wikipedia

• GVB — abbr. Gilbert Varshamov Bound …   Dictionary of abbreviations

• граница Варшамова - Гильберта — Нижняя граница, которая показывает, при каком значении длины кода и длины информационной определено существует код, гарантированно исправляющий ошибки кратности. [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь …   Справочник технического переводчика